منابع مشابه
Directed Subgraph Complexes
Let G be a directed graph, and let ∆ACY G be the simplicial complex whose simplices are the edge sets of acyclic subgraphs of G. Similarly, we define ∆NSC G to be the simplicial complex with the edge sets of not strongly connected subgraphs of G as simplices. We show that ∆ACY G is homotopy equivalent to the (n−1−k)-dimensional sphere if G is a disjoint union of k strongly connected graphs. Oth...
متن کاملComplexes of directed trees and independence complexes
The theory of complexes of directed trees was initiated by Kozlov to answer a question by Stanley, and later on, results from the theory were used by Babson and Kozlov in their proof of the Lovász conjecture. We develop the theory and prove that complexes on directed acyclic graphs are shellable. A related concept is that of independence complexes: construct a simplicial complex on the vertex s...
متن کاملComplexes of Directed Trees
To every directed graph G one can associate a complex (G) consisting of directed subforests. This construction, suggested to us by R. Stanley, is especially important in the case of a complete double directed graph Gn, where it leads to studying some interesting representations of the symmetric group and corresponds (via Stanley-Reisner correspondence) to an interesting quotient ring. Our main ...
متن کاملDirected Acyclic Subgraph Problem Parameterized above the Poljak-Turzik Bound
An oriented graph is a directed graph without directed 2-cycles. Poljak and Turzík (1986) proved that every connected oriented graph G on n vertices and m arcs contains an acyclic subgraph with at least m2 + n−1 4 arcs. Raman and Saurabh (2006) gave another proof of this result and left it as an open question to establish the parameterized complexity of the following problem: does G have an acy...
متن کاملA minimization version of a directed subgraph homeomorphism problem
We consider a special case of the directed subgraph homeomorphism or topologicalminor problem,where the host graph has a specific regular structure. Given an acyclic directed pattern graph, we are looking for a host graph of minimal height which still allows for an embedding. This problem has applications in compiler design for certain coarse-grain reconfigurable architectures. In this applicat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2004
ISSN: 1077-8926
DOI: 10.37236/1828